َa multi-objective simulated annealing algorithm to solving flexible no-wait flowshop scheduling problems with transportation times

this paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the makespan and total weighted tardiness, in which we consider transportation times between stages. obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. this paper presents a new multi-objective simulated annealing algorithm (mosa). a set of experimental instances are carried out to evaluate the algorithm by advanced multi-objective performance measures. the algorithm is carefully evaluated for its performance against available algorithm by means of multi-objective performance measures and statistical tools. the related results show that a variant of our proposed mosa provides sound performance comparing with other algorithms.